Fibonacci numbers, Lucas numbers and integrals of certain Gaussian processes
نویسندگان
چکیده
منابع مشابه
On Certain Arithmetic Properties of Fibonacci and Lucas Numbers
mirroring a well-known feature of Fibonacci numbers (see Theorem 2.5). It was pointed out in [1] that (0.2) could itself be used to disprove the corresponding assertion for the 1cm; precisely, if lcm(a, b) = £, then lcm(Ma, Mb) Mt only in the trivial cases a\b or b\a. The argument rested on a uniqueness theorem for the expression of rational numbers as a ratio of two members of the {Mn} sequenc...
متن کاملThe sum and product of Fibonacci numbers and Lucas numbers, Pell numbers and Pell-Lucas numbers representation by matrix method
Denote by {Fn} and {Ln} the Fibonacci numbers and Lucas numbers, respectively. Let Fn = Fn × Ln and Ln = Fn + Ln. Denote by {Pn} and {Qn} the Pell numbers and Pell-Lucas numbers, respectively. Let Pn = Pn × Qn and Qn = Pn + Qn. In this paper, we give some determinants and permanent representations of Pn, Qn, Fn and Ln. Also, complex factorization formulas for those numbers are presented. Key–Wo...
متن کاملTrigonometric Expressions for Fibonacci and Lucas Numbers
The amount of literature bears witness to the ubiquity of the Fibonacci numbers and the Lucas numbers. Not only these numbers are popular in expository literature because of their beautiful properties, but also the fact that they ‘occur in nature’ adds to their fascination. Our purpose is to use a certain polynomial identity to express these numbers in terms of trigonometric functions. It is in...
متن کاملThe Imperfect Fibonacci and Lucas Numbers
A perfect number is any positive integer that is equal to the sum of its proper divisors. Several years ago, F. Luca showed that the Fibonacci and Lucas numbers contain no perfect numbers. In this paper, we alter the argument given by Luca for the nonexistence of both odd perfect Fibonacci and Lucas numbers, by making use of an 1888 result of C. Servais. We also provide a brief historical accou...
متن کاملEnergy of Graphs, Matroids and Fibonacci Numbers
The energy E(G) of a graph G is the sum of the absolute values of the eigenvalues of G. In this article we consider the problem whether generalized Fibonacci constants $varphi_n$ $(ngeq 2)$ can be the energy of graphs. We show that $varphi_n$ cannot be the energy of graphs. Also we prove that all natural powers of $varphi_{2n}$ cannot be the energy of a matroid.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1996
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-96-03691-x